Methods for Large-Scale Time-Triggered Network Scheduling

Scheduling for Time - Triggered Systems

Optimization Methods for Large-Scale Production Scheduling Problems

In this paper we present a computational study of optimization methods for production scheduling problems which can be described by a job shop model. Contrary to most existing publications in this field our research focuses on the performance of these methods with respect to large-scale problem instances. The examined methods rely on a graph model as a solution representation and have originall...

Scheduling for Large-Scale Systems

In this chapter, scheduling is defined as the activity that consists in mapping a task graph onto a target platform. The task graph represents the application, nodes denote computational tasks, and edges model precedence constraints between tasks. For each task, an assignment (choose the processor that will execute the task) and a schedule (decide when to start the execution) are determined. Th...

On stability analysis methods for large-scale discrete-time systems

This paper proposes a set of Lyapunov-type conditions that are suited for stability analysis of large-scale discrete-time systems. A time-wise relaxation of the Lyapunov function decrease condition is employed to derive a set of global and distributed stability conditions. Essentially, these conditions allow to make a trade-off between complexity and conservatism by extending the time-horizon o...

An Adaptive Time Window Algorithm for Large Scale Network Emulation

With the continuing growth of the Internet and network protocols, there is a need for Protocol Development Environments. Simulation environments like ns and OPNET require protocol code to be rewritten in a discrete event model. Direct Code Execution Environments (DCEE) solve the Verification and Validation problems by supporting the execution of unmodified protocol code in a controlled environm...